MaxDDBS problem on butterfly networks

نویسندگان

  • Novi H. Bong
  • Mirka Miller
  • Joseph F. Ryan
  • Kiki A. Sugeng
چکیده

A maximum degree-diameter bounded subgraph problem can be seen as a degree-diameter problem restricted to certain host graphs. In this paper, we investigate the MaxDDBS problem when the host graph is a butterfly network. We give constructive lower bounds for subgraphs of maximum degree 4, 3 and 2. ∗ Was also at Department of Mathematics, University of West Bohemia, Pilsen, Czech Republic. Deceased January 2016. N.H. BONG ET AL. /AUSTRALAS. J. COMBIN. 68 (2) (2017), 245–264 246

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract)

We present two deterministic routing networks, the pruned butterfly and the sorting fat-tree. Both networks are area-universal, i.e., they can simulate any other routing network fitting in similar area with polylogarithmic slowdown. Previous area-universal networks were either for the off-line problem, where the message set to be routed is known in advance and substantial precomputation is perm...

متن کامل

Investigation of the Flow and Cavitation in a Butterfly Valve

Since knowledge on hydrodynamic torque of a butterfly valve is very important for butterfly valve design, its hydrodynamic torque is investigated in this paper. In reality, the investigation of the loss coefficient and torque from some experiments will take a long time and a lot of money. This paper presents a statistical study of the flow past the butterfly valve in a static analysis using com...

متن کامل

On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks

ÐWe show that the cyclic-cubes defined by Ada W.C. Fu and S.C. Chau [1] are isomorphic to k-ary wrapped butterfly networks. Index TermsÐCyclic-cubes, wrapped butterfly networks.

متن کامل

Hypercube Networks - III

1. Review of the previous lecture This section highlights the problem of routing a hard problem on the butterfly network. 2. Valiant’s Algorithm This section describes the idea behind Valiant’s algorithm for solving a hard problem on the butterfly network. 3. Ranade’s Algorithm This section briefly introduces Ranade’s algorithm. 4. Shuffle-exchange graph This section explains the properties of ...

متن کامل

VLSI Layout of Benes Networks

The Benes network consists of back-to-back butterflies. There exist a number of topological representations that are used to describe butterfly like architectures. We identify a new topological representation of Benes network. The significance of this representation is demonstrated by solving two problems, one related to VLSI layout and the other related to robotics. An important VLSI layout ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 68  شماره 

صفحات  -

تاریخ انتشار 2017